Recent Progress on the Isomorphism Problem

نویسنده

  • LEONARD L. SCOTT
چکیده

A long-standing problem, posed first by Graham Higman in 1940 [Hi] and later by Brauer [Br], is the “isomorphism problem for integral group rings.” Given finite groups G and H, is it true that ZG N ZH implies G N H? Many authors have worked on this question but progress has been difficult [Sal. Perhaps the best positive result was that of Whitcomb in 1968 [Wh], who showed that the implication G N H holds for G metabelian. Dade [D] showed there were counterexamples, even in the metabelian case, if Z was replaced by the family of all fields. We began our investigation also looking for counterexamples. Zassenhaus had conjectured, perhaps as early as 1960, a much stronger result, describing in part just how the isomorphism might come about: Observe first that the group of units of SG, for S any commutative ring, has the form Sx XV where V = V(SG) is the group of normalized units (those with augmentation 1) in SG. So not much is lost by restricting attention to normalized unit groups (subgroups of V), and indeed every group basis for SG is isomorphic by projection to a normalized subgroup. This is one of the first observations of Higman’s thesis [Hi], where it was also shown that the elements of normalized finite unit groups in ZG are linearly independent and generate a pure Z-submodule. Zassenhaus (cf. [Za] or [Se]) conjectured that, if H is any normalized finite unit group in ZG with ZG = ZH (that is, H is a normalized group basis for ZG), then H must be conjugate to G by a unit in QG. Note that the conjectured conjugacy is in QG, and not ZG. It turns out that even the dihedral group of order 8 has two normalized group bases for its group ring over Z, which are not conjugate in ZG, but indeed are conjugate in QG [Wh]. Nevertheless, Klaus Roggenkamp and I still felt that the conjecture was much too strong and about six years ago made a first intensive search for counterexamples. The remainder of this paper, except as otherwise noted, is a report of our joint work.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The isomorphism problem for Coxeter groups

By a recent result obtained by R. Howlett and the author considerable progress has been made towards a complete solution of the isomorphism problem for Coxeter groups. In this paper we give a survey on the isomorphism problem and explain in particular how the result mentioned above reduces it to its ‘reflection preserving’ version. Furthermore we desrcibe recent developments concerning the solu...

متن کامل

Linear Algebraic Analogues of the Graph Isomorphism Problem and the Erdős-Rényi Model

A classical difficult isomorphism testing problem is to test isomorphism of p-groups of class 2 and exponent p in time polynomial in the group order. It is known that this problem can be reduced to solving the alternating matrix space isometry problem over a finite field in time polynomial in the underlying vector space size. We propose a venue of attack for the latter problem by viewing it as ...

متن کامل

Linear algebraic analogues of the graph isomorphism problem and the Erd\H{o}s-R\'enyi model

A classical difficult isomorphism testing problem is to test isomorphism of p-groups of class 2 and exponent p in time polynomial in the group order. It is known that this problem can be reduced to solving the alternating matrix space isometry problem over a finite field in time polynomial in the underlying vector space size. We propose a venue of attack for the latter problem by viewing it as ...

متن کامل

Groups, Graphs, Algorithms: The Graph Isomorphism Problem∗

Graph Isomorphism (GI) is one of a small number of natural algorithmic problems with unsettled complexity status in the P /NP theory: not expected to be NP-complete, yet not known to be solvable in polynomial time. Arguably, the GI problem boils down to filling the gap between symmetry and regularity, the former being defined in terms of automorphisms, the latter in terms of equations satisfied...

متن کامل

Analytics Isomorphism and Speech Perception

The suggestion that analytic isomorphism should be rejected applies especially to the domain of speech perception because (1) the guiding assumption that solving the lack of invariance problem is the key to explaining speech perception is a form of analytic isomorphism, and (2) after nearly half a century of research there is virtually no empirical evidence of isomorphism between perceptual exp...

متن کامل

Structural and logical approaches to the graph isomorphism problem

The question of whether there is a polynomial time algorithm deciding whether two graphs are isomorphic has been a one of the best known open problems in theoretical computer science for more than forty years. Indeed, the graph isomorphism problem is one of the very few natural problems in NP that is neither known to be in P nor known to be NP-complete. The question is still wide open, but a nu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998